- lattice embedding
- <math.> вложение в структуру
Англо-русский технический словарь.
lattice embedding
Смотреть что такое "lattice embedding" в других словарях:
Completely distributive lattice — In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets. Formally, a complete lattice L is said to be completely distributive if, for any doubly… … Wikipedia
Convex lattice polytope — A convex lattice polytope (also called Z polyhedron or Z polytope) is a geometric object playing an important role in discrete geometry and combinatorial commutative algebra. It is a polytope in a Euclidean space Rn which is a convex hull of… … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Del Pezzo surface — In mathematics, a del Pezzo surface or Fano surface is a two dimensional Fano variety, in other words a non singular projective algebraic surface with ample anticanonical divisor class. They are in some sense the opposite of surfaces of general… … Wikipedia
Dedekind–MacNeille completion — The Hasse diagram of a partially ordered set (left) and its Dedekind–MacNeille completion (right). In order theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal… … Wikipedia
Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… … Wikipedia
Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y) (cl… … Wikipedia
SQ universal group — In mathematics, in the realm of group theory, a countable group is said to be SQ universal if every countable group can be embedded in one of its quotient groups. SQ universality can be thought of as a measure of largeness or complexity of a… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Torus — Not to be confused with Taurus (disambiguation). This article is about the surface and mathematical concept of a torus. For other uses, see Torus (disambiguation). A torus As the distance to th … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
